A next-generation wide color gamut WLED with improved spectral performance in phosphor composite functional solid

As is well known, a way to obtain a high color resolution and saturation of a liquid crystal display and thereby obtain a higher visual accuracy and comfort in the coming 5G era remains an urgent challenge. In the present study, a new type of phosphor composite material doped with Ln³⁺ ions provides a promising alternative to the color filters used in White light-emitting diodes (WLEDs), achieving a better performance regarding the realization of a wider color gamut. The advantages of this composite material are illustrated through an abundant phase and morphology analysis along with a discussion regarding the X-ray photoelectron spectroscopy of the valence bond of Ce ions, which maintain the luminescence properties of the phosphor while providing a stable and solid amorphous environment. An improved spectral performance was obtained through color filtering at 580 nm along with the regulating effects of red, green, and blue emissions according to the doped Ln³⁺ ions. Notably, we fabricated a high-performance WLED based on a Ln³⁺-doped PiG with a correlated color temperature of 5037 K, color rendering index of 72.8, and high color gamut of 91.97%, providing a new choice for the development of luminescence materials with a high color resolution and saturation.     

PTA污水厂COD在线监测结果不合格原因分析及对策

对在线自动监测仪监测结果与人工化验数据存在误差的原因进行分析,以提高在线自动监测仪监测结果的科学性和可靠性,并提出了相对应的建议,有效提升装置出水合格率。     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.     

Low complexity quantum private queries protocol

Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved.     

一例带电水冲洗触发的220kV避雷器爆炸事故分析

对一例220 kV金属氧化物避雷器在带电水冲洗后发生爆炸故障的原因进行了分析。通过对完好避雷器和故障避雷器进行解体和对比分析,发现故障避雷器下节顶部压力释放装置内部的密封胶圈发生凹陷变形。最后,对该类事故提出预防措施。     

The development of a single-item Food Choice Questionnaire

Based on the multi-item Food Choice Questionnaire (FCQ) originally developed by Steptoe and colleagues (1995), the current study developed a single-item FCQ that provides an acceptable balance between practical needs and psychometric concerns. Studies 1 (N = 1851) and 2 (2a (N = 3290), 2b (N = 4723), 2c (N = 270)) showed that the single-item FCQ scale has good convergent and discriminant validity. Generally, the results showed the highest correlations with the related multi-item dimensions (>0.40). Study 2 refined the scale. Only the items for convenience (Study 2a), sensory appeal (Study 2b) and mood (Study 2c) needed to be revised (as Study 1 showed a correlation between the multi-item and the single-item below the threshold of 0.60). The results also showed comparable predictive validity. Both methods revealed similar association patterns between food motives and consumption behaviours (Fisher’s z tests revealed agreements of 86.2% for Study 1, 92.9% for Study 2a and 100% for Studies 2b and 2c). Study 3 (N = 6062) showed an example of the added value of a context-specific application for the single-item FCQ. Different motives were shown to be relevant across contexts, and the context-specific motives had additional explained variance beyond the general multi-item FCQ. Studies 2b and 3 also showed the performance of the single-item FCQ in an international context. In sum, the results indicate that the single-item FCQ can be used as a flexible and short substitute for the multi-item FCQ. The study also discusses the conditions that should be considered when using the single-item scale.     

ECISER: Efficient Clip-art Image SEgmentation by Re-rasterization

Clip-art image segmentation is widely used as an essential step to solve many vision problems such as colorization and vectorization. Many of these applications not only demand accurate segmentation results, but also have little tolerance for time cost, which leads to the main challenge of this kind of segmentation. However, most existing segmentation techniques are found not sufficient for this purpose due to either their high computation cost or low accuracy. To address such issues, we propose a novel segmentation approach, ECISER, which is well-suited in this context. The basic idea of ECISER is to take advantage of the particular nature of cartoon images and connect image segmentation with aliased rasterization. Based on such relationship, a clip-art image can be quickly segmented into regions by re-rasterization of the original image and several other computationally efficient techniques developed in this paper. Experimental results show that our method achieves dramatic computational speedups over the current state-of-the-art approaches, while preserving almost the same quality of results.     

Optimal shift partitioning of pharmacies

The pharmacy service requires that some pharmacies are always available and shifts have to be organized: a shift corresponds to a subset of pharmacies that must be open 24 hours a day on a particular week. Under the requirement that each pharmacy belongs to exactly one shift and the assumption that users minimize the distance to the closest open pharmacy during each shift, we want to determine a partition of the pharmacies into a given number of shifts, such that the total distance covered by users is minimized. It may be also required that shift cardinalities are balanced. We discuss different versions and the related computational complexity, showing that the problem is NP-hard in general. A set packing formulation is presented and solved by branch-and-price, together with a fast solution technique based on a tabu search. They have been applied to real and random instances showing that (i) the set packing formulation is very tight and often exhibits no integrality gap; (ii) the branch-and-price solves problems of practical relevance to optimality in a reasonable amount of time (order of minutes); (iii) the tabu search finds optimal or near-optimal solutions in order of seconds.